*****************************************************************************
                     Task identifier - 0000_mbo_00000.TEST01
*****************************************************************************
> Start of solving the task "0000_mbo_00000.TEST01":  14:02:14 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage of task data input. Number of expense items - 4.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 1 ***
2. It is the end of a stage of formation of DSP phase states array for 1-th expense item, number of which equals 6410.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 1-th expense item.
4. It is the end of numerical optimization stage for 1-th expense item. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 5. Maximum value of local quality criterion - 7,99 monet.units
5. It is the end of a stage of formation of optimal output data for 1-th expense item.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 2 ***
2. It is the end of a stage of formation of DSP phase states array for 2-th expense item, number of which equals 15014.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 2-th expense item.
4. It is the end of numerical optimization stage for 2-th expense item. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 5. Maximum value of local quality criterion - 13,95 monet.units
5. It is the end of a stage of formation of optimal output data for 2-th expense item.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 3 ***
2. It is the end of a stage of formation of DSP phase states array for 3-th expense item, number of which equals 8010.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 3-th expense item.
4. It is the end of numerical optimization stage for 3-th expense item. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 5. Maximum value of local quality criterion - 11,09 monet.units
5. It is the end of a stage of formation of optimal output data for 3-th expense item.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 4 ***
2. It is the end of a stage of formation of DSP phase states array for 4-th expense item, number of which equals 18014.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 4-th expense item.
4. It is the end of numerical optimization stage for 4-th expense item. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 5. Maximum value of local quality criterion - 17,93 monet.units
5. It is the end of a stage of formation of optimal output data for 4-th expense item.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_mbo_00000.TEST01", which consists in formation of output data file for 4 given expense items.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_mbo_00000.TEST01" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_gao_00000.DEME01
*****************************************************************************
> Start of solving the task "0000_gao_00000.DEME01":  14:02:17 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage of task data input. Number of variants of a threshold to restrict time of executing the network graph of 1 chains of operations - 5.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 1 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 429, for 1-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 1-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 1-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 1-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 4425000,00 monet.units at a time threshold of restriction - 900,00 time units
5. It is the end of a stage of formation of optimal output data for 1-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 2 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 499, for 2-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 2-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 2-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 2-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 3870000,00 monet.units at a time threshold of restriction - 1050,00 time units
5. It is the end of a stage of formation of optimal output data for 2-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 3 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 604, for 3-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 3-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 3-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 3-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 3330000,00 monet.units at a time threshold of restriction - 1275,00 time units
5. It is the end of a stage of formation of optimal output data for 3-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 4 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 709, for 4-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 4-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 4-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 4-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 3000000,00 monet.units at a time threshold of restriction - 1500,00 time units
5. It is the end of a stage of formation of optimal output data for 4-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 5 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 751, for 5-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 5-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 5-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 5-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 2880000,00 monet.units at a time threshold of restriction - 1590,00 time units
5. It is the end of a stage of formation of optimal output data for 5-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_gao_00000.DEME01", consisting in forming the output data file for 5 of set variants of a restriction threshold.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_gao_00000.DEME01" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_io_00000.DEME31
*****************************************************************************
> Start of solving the task "0000_io_00000.DEME31":  14:02:19 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data. Number of investment options - 3.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 1 ***
2. It is end of a stage of forming the array of DPS phase states for 1-th investment option, number of which equal 40022.
3. It is the end of a stage of forming arrays of controls and of step losses for 1-th investment option.
4. It is the end of numerical optimization stage for 1-th investment option. OPTIMAL STRATEGY IS FOUND !
    Number of optimization circles - 25. Maximum absolute income from acquisition PG 20-th types - 161241,60 mone.units.
5. It is the end of a stage of forming optimal output data for 1-th investment option.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 2 ***
2. It is end of a stage of forming the array of DPS phase states for 2-th investment option, number of which equal 50022.
3. It is the end of a stage of forming arrays of controls and of step losses for 2-th investment option.
4. It is the end of numerical optimization stage for 2-th investment option. OPTIMAL STRATEGY IS FOUND !
    Number of optimization circles - 25. Maximum absolute income from acquisition PG 20-th types - 166594,56 mone.units.
5. It is the end of a stage of forming optimal output data for 2-th investment option.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 3 ***
2. It is end of a stage of forming the array of DPS phase states for 3-th investment option, number of which equal 60022.
3. It is the end of a stage of forming arrays of controls and of step losses for 3-th investment option.
4. It is the end of numerical optimization stage for 3-th investment option. OPTIMAL STRATEGY IS FOUND !
    Number of optimization circles - 25. Maximum absolute income from acquisition PG 20-th types - 167573,76 mone.units.
5. It is the end of a stage of forming optimal output data for 3-th investment option.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_io_00000.DEME31", consisting in forming the output data file for 3 of the given options of investment.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_io_00000.DEME31" - 0:00:02.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_eo_00000.TEST01
*****************************************************************************
> Start of solving the task "0000_eo_00000.TEST01":  14:02:23 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data.
-----------------------------------------------------------------------------
2. It is the end of a stage to form the array of phase states of optimizable process, the number of which equals 92318.
3. It is the end of a stage to form arrays of controls and of step losses.
4. It is the end of a stage of numerical optimization. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 335. Maximum total purchasing worth of acquired samples GD - 5209,21 monet.un.
5. It is the end of a stage to form optimal output data of the task for the allocated amount of money in 3000,08 monet.un.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_eo_00000.TEST01", consisting in forming the output data file.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_eo_00000.TEST01" - 0:00:08.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_hio_00000.TEST04
*****************************************************************************
> Start of solving the task "0000_hio_00000.TEST04":  14:02:33 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data. Actual number of HO variants - 2.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 1 ***
2. It is the end of a stage of forming DPS phase states array for 1-th variant of HO at number 1, number of which equals 7163.
3. It is the end of a stage of forming arrays of controls and of step losses for 1-th variant of HO at number 1.
4. It is the end of a stage of numerical optimization for 1-th variant of HO at number 1. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 5. Maximum integral factor of attractiveness of HO - 0,732.
5. It is the end of a stage of forming optimal output data for 1-th variant of HO at number 1.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 2 ***
2. It is the end of a stage of forming DPS phase states array for 2-th variant of HO at number 3, number of which equals 6613.
3. It is the end of a stage of forming arrays of controls and of step losses for 2-th variant of HO at number 3.
4. It is the end of a stage of numerical optimization for 2-th variant of HO at number 3. OPTIMAL STRATEGY IS FOUND!
    Number of optimization circles - 5. Maximum integral factor of attractiveness of HO - 0,817.
5. It is the end of a stage of forming optimal output data for 2-th variant of HO at number 3.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_hio_00000.TEST04", which consists in formation of output data file for 2 of the given HO variants.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_hio_00000.TEST04" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_rio_00000.DEME12
*****************************************************************************
> Start of solving the task "0000_rio_00000.DEME12":  14:02:35 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage of entry the task input data. Number of investment options - 2.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 1 ***
2. It is the end of a stage of forming DPS phase states array for 1-th investment option, a number of which equal 754508.
3. It is the end of a stage of forming arrays of controls and of step losses for 1-th investment option.
4. It is the end of numerical optimizatiom stage for 1-th investment option. OPTIMAL STRATEGY IS FOUND!
    Number of optimization process iterations - 20. Maximum absolute income from sale 6 REOs - 20400,00 mone.units
5. It is the end of a stage of forming optimal output data for 1-th investment option.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 2 ***
2. It is the end of a stage of forming DPS phase states array for 2-th investment option, a number of which equal 604208.
3. It is the end of a stage of forming arrays of controls and of step losses for 2-th investment option.
4. It is the end of numerical optimizatiom stage for 2-th investment option. OPTIMAL STRATEGY IS FOUND!
    Number of optimization process iterations - 20. Maximum absolute income from sale 6 REOs - 31400,00 mone.units
5. It is the end of a stage of forming optimal output data for 2-th investment option.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_rio_00000.DEME12", which consists in formation of output data file for 2 given options of investment.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_rio_00000.DEME12" - 0:00:11.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_npo_00000.04
*****************************************************************************
> Start of solving the task "0000_npo_00000.04":  14:02:49 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data.
-----------------------------------------------------------------------------
2. It is end of a stage of forming the array of phase states of optimizable process, the number of which equals 60006.
3. It is the end of a stage of forming arrays of controls and of step losses.
4. It is the end of a stage of numerical optimization. OPTIMAL STRATEGY IS FOUND!
    Number of optimization process iterations - 335. Maximum total purchasing worth of the acquired samples of goods - 16561,36 monetary units.
5. The end of a stage of forming optimal output data of the task for the selected amount of money in 15000,00 monetary units.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_npo_00000.04", which consists in formation of output data file.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_npo_00000.04" - 0:00:03.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_to_00000.EEEE13
*****************************************************************************
> Start of solving the task "0000_to_00000.EEEE13":  14:02:56 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data.
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 1/12 TP with numbers 1 and 3), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 1/12 TP with numbers 1 and 3).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 30. Minimum losses from servicing by the transport vehicle 2 of target points - 35,54 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 1/12 TP with numbers 1 and 3).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 2/12 TP with numbers 1 and 4), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 2/12 TP with numbers 1 and 4).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 23,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 2/12 TP with numbers 1 and 4).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 3/12 TP with numbers 1 and 5), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 3/12 TP with numbers 1 and 5).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 20,06 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 3/12 TP with numbers 1 and 5).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 4/12 TP with numbers 2 and 1), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 4/12 TP with numbers 2 and 1).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 35. Minimum losses from servicing by the transport vehicle 2 of target points - 31,60 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 4/12 TP with numbers 2 and 1).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 5/12 TP with numbers 2 and 3), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 5/12 TP with numbers 2 and 3).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 30. Minimum losses from servicing by the transport vehicle 2 of target points - 35,31 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 5/12 TP with numbers 2 and 3).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 6/12 TP with numbers 2 and 4), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 6/12 TP with numbers 2 and 4).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 23,46 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 6/12 TP with numbers 2 and 4).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 7/12 TP with numbers 3 and 1), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 7/12 TP with numbers 3 and 1).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 35. Minimum losses from servicing by the transport vehicle 2 of target points - 45,54 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 7/12 TP with numbers 3 and 1).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 8/12 TP with numbers 3 and 4), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 8/12 TP with numbers 3 and 4).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 23,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 8/12 TP with numbers 3 and 4).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 9/12 TP with numbers 3 and 5), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 9/12 TP with numbers 3 and 5).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 24,17 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 9/12 TP with numbers 3 and 5).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 10/12 TP with numbers 4 and 1), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 10/12 TP with numbers 4 and 1).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 35. Minimum losses from servicing by the transport vehicle 2 of target points - 38,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 10/12 TP with numbers 4 and 1).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 11/12 TP with numbers 4 and 3), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 11/12 TP with numbers 4 and 3).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 30. Minimum losses from servicing by the transport vehicle 2 of target points - 28,69 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 11/12 TP with numbers 4 and 3).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 1 of solving the task (for a pair 12/12 TP with numbers 4 and 5), which number equals 726.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 1 of solving the task (for a pair 12/12 TP with numbers 4 and 5).
4. It is the end of numerical optimization (a stage 1 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 25. Minimum losses from servicing by the transport vehicle 2 of target points - 20,06 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 1 of solving the task (for a pair 12/12 TP with numbers 4 and 5).
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of process phase states at the stage 2 of solving the task, number of which equals 22.
3. It is the end of a stage of forming the arrays of controls and step losses at the stage 2 of solving the task.
4. It is the end of numerical optimization (a stage 2 of solving a task). OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 5. Minimum losses from servicing by the transport vehicle 5 of target points - 108,14 cost un.
5. It is the end of a stage of forming the optimal output data at the stage 2 of solving the task.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_to_00000.EEEE13", consisting in forming the output data file.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_to_00000.EEEE13" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

*****************************************************************************
                     Task identifier - 0000_ptpdo_00000.EEEE01
*****************************************************************************
> Start of solving the task "0000_ptpdo_00000.EEEE01":  14:02:59 (time), 14.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage to enter the task input data.
-----------------------------------------------------------------------------
2. It is the end of a stage of forming the array of phase states of optimizable process, the number of which equals 457.
3. It is the end of a stage of forming arrays of controls and of step losses.
4. It is the end of numerical optimizat. stage. OPTIMAL STRATEGY IS FOUND!
    Number of optimization cycles - 20. Minimum time of delivery of a passenger to the required target point by urban transport - 57,85 minutes.
5. It is the end of a stage of forming optimal output data.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "0000_ptpdo_00000.EEEE01", which consists in formation of output data file.
-----------------------------------------------------------------------------
> Duration of solving the task "0000_ptpdo_00000.EEEE01" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

